Data Mining with Concept Generalization Digraphs
نویسندگان
چکیده
Wanlin Pang, Robert J. Hilderman, Howard J. Hamilton, and Scott D. Goodwin Department of Computer Science University of Regina Regina, Saskatchewan, Canada, S4S 0A2 fpang,hilder,hamilton,[email protected] Abstract We present the Path-Based Generalization and Bias-Based Generalization algorithms for attribute-oriented induction using concept generalization digraphs. Concept generalization digraphs are constructed from multiple concept hierarchies associated with an attribute, or set of attributes, in a database. The algorithms e ciently manage the generalization process by avoiding unnecessary re-generalization and by determining which intermediate generalized relations to store for possible future use.
منابع مشابه
Returnability in complex directed networks (digraphs)
The concept of returnability is proposed for complex directed networks (digraphs). It can be seen as a generalization of the concept of reciprocity. Two measures of the returnability are introduced. We establish closed formulas for the calculation of the returnability measures, which are also related to the digraph spectrum. The two measures are calculated for simple examples of digraphs as wel...
متن کاملON (k, l)-KERNEL PERFECTNESS OF SPECIAL CLASSES OF DIGRAPHS
In the first part of this paper we give necessary and sufficient conditions for some special classes of digraphs to have a (k, l)-kernel. One of them is the duplication of a set of vertices in a digraph. This duplication come into being as the generalization of the duplication of a vertex in a graph (see [4]). Another one is the D-join of a digraph D and a sequence α of nonempty pairwise disjoi...
متن کاملChapter III Generalization Data Mining in Fuzzy Object - Oriented Databases
In this chapter, we consider the application of generalization-based data mining to fuzzy similarity-based object-oriented databases (OODBs). Attribute generalization algorithms have been most commonly applied to relational databases, and we extend these approaches. A key aspect of generalization data mining is the use of a concept hierarchy. The objects of the database are generalized by repla...
متن کاملAbelian Cayley Digraphs with Asymptotically Large Order for Any Given Degree
Abelian Cayley digraphs can be constructed by using a generalization to Zn of the concept of congruence in Z. Here we use this approach to present a family of such digraphs, which, for every fixed value of the degree, have asymptotically large number of vertices as the diameter increases. Up to now, the best known large dense results were all non-constructive.
متن کاملA Data-driven Method for Crowd Simulation using a Holonification Model
In this paper, we present a data-driven method for crowd simulation with holonification model. With this extra module, the accuracy of simulation will increase and it generates more realistic behaviors of agents. First, we show how to use the concept of holon in crowd simulation and how effective it is. For this reason, we use simple rules for holonification. Using real-world data, we model the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007